Solving dynamic multi-objective problems with a new prediction-based optimization algorithm
نویسندگان
چکیده
This paper proposes a new dynamic multi-objective optimization algorithm by integrating fitting-based prediction (FBP) mechanism with regularity model-based estimation of distribution (RM-MEDA) for in changing environments. The prediction-based reaction aims to generate high-quality population when changes occur, which includes three subpopulations tracking the moving Pareto-optimal set effectively. first subpopulation is created simple linear model two different stepsizes. second consists some sampling individuals generated strategy. third employing recent strategy, generating effective search improving convergence and diversity. Experimental results on benchmark functions variety characteristics difficulties illustrate that proposed has competitive effectiveness compared state-of-the-art algorithms.
منابع مشابه
solution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
Differential Evolution Algorithm for Solving Multi-objective Optimization Problems
This paper presents a modified Differential Evolution (DE) algorithm called OCMODE for solving multi-objective optimization problems. First, the initialization phase is improved by using the opposition based learning. Further, a time varying scale factor F employing chaotic sequence is used which helps to get a well distributed Pareto front by the help of non dominated and crowding distance sor...
متن کاملSolving a New Multi-objective Unrelated Parallel Machines Scheduling Problem by Hybrid Teaching-learning Based Optimization
This paper considers a scheduling problem of a set of independent jobs on unrelated parallel machines (UPMs) that minimizesthe maximum completion time (i.e., makespan or ), maximum earliness ( ), and maximum tardiness ( ) simultaneously. Jobs have non-identical due dates, sequence-dependent setup times and machine-dependentprocessing times. A multi-objective mixed-integer linear programmi...
متن کاملA New Evolutionary Algorithm for Multi-objective Optimization Problems
Among the currently successful Evolutionary Multi-Objective Algorithms (MOEAs), elitism and no sharing factor are two common characteristics and have been demonstrated to improve performance significantly. Based on these two principles, two heuristics, with which impressive improvements were showed in single objective optimization, are introduced in a newly designed EMOA in this paper: multi-pa...
متن کاملMulti-objective Phylogenetic Algorithm: Solving Multi-objective Decomposable Deceptive Problems
In general, Multi-objective Evolutionary Algorithms do not guarantee find solutions in the Pareto-optimal set. We propose a new approach for solving decomposable deceptive multi-objective problems that can find all solutions of the Pareto-optimal set. Basically, the proposed approach starts by decomposing the problem into subproblems and, then, combining the found solutions. The resultant appro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2021
ISSN: ['1932-6203']
DOI: https://doi.org/10.1371/journal.pone.0254839